Integer partitions and the Sperner property

نویسنده

  • E. Rodney Canfield
چکیده

The objectives of this paper are three-fold. First, we would like to call attention to a very attractive problem, the question of whether or not the poset of integer partitions ordered by re&nement has the Sperner property. We provide all necessary de&nitions, and enough bibliography to interest a newcomer in the problem. Second, we prove four new theorems, two by exhaustive computation and two in the more traditional manner. Finally, we highlight the central role played by Larry Harper in the literature of this subject. c © 2003 Elsevier B.V. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Sperner Property for Integer Partition Posets

We examine the integer partition poset, Pn, ordered by a covering relation to determine whether or not it has the Sperner property. To show that Pn is Sperner we must prove it satisfies unimodality and the bipartite matching property. It has been shown computationally by Canfield for n ≤ 2000 and asymptotically by Szekeres for n sufficiently large that Pn is unimodal. Computationally, we have i...

متن کامل

The Linear Chromatic Number of Sperner Families

Let S be a set with m elements and S a complete Sperner family on S, i.e. a Sperner family such that every x ∈ S is contained in some member of S. The linear chromatic number of S, defined by Civan, is the smallest integer n with the property that there exists a function f : S → {1, . . . , n} such that if f(x) = f(y), then every set in S which contains x also contains y, or every set in S whic...

متن کامل

A Sperner-Type Theorem for Set-Partition Systems

A Sperner partition system is a system of set partitions such that any two set partitions P and Q in the system have the property that for all classes A of P and all classes B of Q, A 6⊆ B and B 6⊆ A. A k-partition is a set partition with k classes and a k-partition is said to be uniform if every class has the same cardinality c = n/k. In this paper, we prove a higher order generalization of Sp...

متن کامل

Collections of Subsets with the Sperner Property

Let X = {1,. . ., n) and Í" = {1,..., k), k < n. Let C(n, k) be the subsets of X which intersect Y, ordered by inclusion. Lih showed that C(n, k) has the Sperner property. Here it is shown that C(n, k) has several stronger properties. A nested chain decomposition is constructed for C(n, k) by bracketing. C(n, k) is shown to have the LYM property. A more general class of collections of subsets i...

متن کامل

Stirling number of the fourth kind and lucky partitions of a finite set

The concept of Lucky k-polynomials and in particular Lucky χ-polynomials was recently introduced. This paper introduces Stirling number of the fourth kind and Lucky partitions of a finite set in order to determine either the Lucky k- or Lucky χ-polynomial of a graph. The integer partitions influence Stirling partitions of the second kind.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 307  شماره 

صفحات  -

تاریخ انتشار 2003